Transforming XML DTD to Relational Schema

نویسندگان

  • Dongwon Lee
  • Wesley W. Chu
چکیده

As Extensible Markup Language (XML) 5] is emerging as the data format of the internet era, there are increasing needs to ee-ciently store and query XML data. One way towards this goal is using relational database by transforming XML data into relational format. In this paper, we argue that existing transformation algorithms are not complete in the sense that they focus only on structural aspects and ignoring semantic aspects. We present the semantic knowledge that needs to be captured during the transformation to ensure a correct relational schema. Further, we show a simple algorithm that can 1) derive such semantic knowledge from the given XML Document Type Deenition (DTD) and 2) preserve the knowledge by representing them in terms of semantic constraints in relational database terms. By combining the existing transformation algorithms and our constraints-preserving algorithm , one can transform XML DTD to relational schema where correct semantics and behaviors are guaranteed by the preserved constraints. Experimental results are also presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constraints-preserving Transformation from XML Document Type De nition to Relational Schema

As Extensible Markup Language (XML) 5] is emerging as the data format of the internet era, more needs to eeciently store and query XML data arise. One way towards this goal is using relational database by transforming XML data into relational format. In this paper, we argue that existing transformation algorithms are not complete in the sense that they focus only on structural aspects, while ig...

متن کامل

CPI : Constraints - Preserving InliningAlgorithm for

As Extensible Markup Language (XML) is emerging as the data format of the In-ternet era, there are increasing needs to eeciently store and query XML data. One path to this goal is transforming XML data into relational format in order to use relational database technology. Although several transformation algorithms exist, they are incomplete in the sense that they focus only on structural aspect...

متن کامل

Translating Relational Schema with Constraints into Xml Schema

With XML adopted as technology trend on the Internet, and with investment in the current relational database systems, companies must convert their relational data into XML documents for data transmission on the Internet. In the process, to preserve the users’ relational data requirements of data constraints into the converted XML documents, we must define a meaningful root element for each XML ...

متن کامل

From XML Schema to Object-Relational Database - An XML Schema-Driven Mapping Algorithm

Since XML becomes a crucial format for representing information, it is necessary to establish techniques for managing XML documents. A possible solution can be found in storing XML data in (object-)relational databases. For this purpose most of the existing techniques often exploit an XML schema of the stored XML data, usually expressed in DTD. But the more complex today’s applications are, the...

متن کامل

DTD-Diff: A Change Detection Algorithm for DTDs

The DTD of a set of XML documents may change due to many reasons such as changes to the real world events, changes to the user’s requirements, and mistakes in the initial design. In this paper, we present a novel algorithm called DTD-Diff to detect the changes to DTDs that defines the structure of a set of XML documents. Such change detection tool can be useful in several ways such as maintenan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000